Perfect Secret Sharing Schemes from Room Squares
نویسندگان
چکیده
Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares
منابع مشابه
Perfect Secret Sharing Schemes from
Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.
متن کاملPerfect Secret Sharing Schemes Based on Generalized Kirkman Squares
Many mathematical structures have been used to model Secret Sharing Schemes. This paper firstly presents a secret sharing schemes based on starter-adder sets of generalized Kirkman squares. Finally, we prove that the scheme is perfect.
متن کاملSecret Sharing Schemes Based on Room Squares
In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کامل